Restricted Trees: Simplifying Networks with Bottlenecks
نویسندگان
چکیده
منابع مشابه
Restricted trees: simplifying networks with bottlenecks.
Suppose N is a phylogenetic network indicating a complicated relationship among individuals and taxa. Often of interest is a much simpler network, for example, a species tree T, that summarizes the most fundamental relationships. The meaning of a species tree is made more complicated by the recent discovery of the importance of hybridizations and lateral gene transfers. Hence, it is desirable t...
متن کاملCommunities and bottlenecks: trees and treelike networks have high modularity.
Much effort has gone into understanding the modular nature of complex networks. Communities, also known as clusters or modules, are typically considered to be densely interconnected groups of nodes that are only sparsely connected to other groups in the network. Discovering high quality communities is a difficult and important problem in a number of areas. The most popular approach is the objec...
متن کاملSimplifying Decision Trees: A Survey1
Induced decision trees are an extensively-researched solution to classiication tasks. For many practical tasks, the trees produced by tree-generation algorithms are not comprehensible to users due to their size and complexity. Although many tree induction algorithms have been shown to produce simpler, more comprehensi-ble trees (or data structures derived from trees) with good classiication acc...
متن کاملGrammars with Restricted Derivation Trees
This extended abstract of the doctoral thesis studies theoretical properties of grammars with restricted derivation trees. After presenting the state of the art concerning this investigation area, the research is focused on the three main kinds of the restrictions placed upon the derivation trees. First, it introduces completely new investigation area represented by cut-based restriction and ex...
متن کاملPercolation in networks with voids and bottlenecks.
A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the subnet mesh size goes to zero. The validity of this method is tested for bond percolation on filled checkerboard and "stack-of-triangle" lattices. Thresholds for the checkerboard lattices of different mesh sizes are estimated using the gradient percolation method,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Biology
سال: 2011
ISSN: 0092-8240,1522-9602
DOI: 10.1007/s11538-010-9624-2